Sampling of Graph Signals via Randomized Local Aggregations
نویسندگان
چکیده
منابع مشابه
Spectral Domain Sampling of Graph Signals
Sampling methods for graph signals in the graph spectral domain are proposed. Conventional sampling of graph signals can be regarded as sampling in the graph vertex domain, but it does not have desired characteristics in regard to the graph spectral domain. Downand upsampled graph signals by using our methods inherit the frequency domain characteristics of sampled signals defined in the time/sp...
متن کاملGraph Sparsification via Refinement Sampling
A graph G(V,E) is an ǫ-sparsification of G for some ǫ > 0, if every (weighted) cut in G is within (1 ± ǫ) of the corresponding cut in G. A celebrated result of Benczúr and Karger shows that for every undirected graph G, an ǫ-sparsification with O(n log n/ǫ) edges can be constructed in O(m log n) time. The notion of cut-preserving graph sparsification has played an important role in speeding up ...
متن کاملSensor Selection via Randomized Sampling
Given a linear dynamical system, we consider the problem of selecting a subset of sensors out of the total set in order to optimize two commonly used metrics of observability, namely the maximum eigenvalue and the trace of the observability Gramian. We apply a variant of a well-known randomized sampling algorithm and derive novel lower bounds on the two metrics relative to the total value with ...
متن کاملSampling and Reconstruction of Graph Signals via Weak Submodularity and Semidefinite Relaxation
We study the problem of sampling a bandlimited graph signal in the presence of noise, where the objective is to select a node subset of prescribed cardinality that minimizes the signal reconstruction mean squared error (MSE). To that end, we formulate the task at hand as the minimization of MSE subject to binary constraints, and approximate the resulting NP-hard problem via semidefinite program...
متن کاملStructured sampling and fast reconstruction of smooth graph signals
This work concerns sampling of smooth signals on arbitrary graphs. We first study a structured sampling strategy for such smooth graph signals that consists of a random selection of few pre-defined groups of nodes. The number of groups to sample to stably embed the set of k-bandlimited signals is driven by a quantity called the group graph cumulative coherence. For some optimised sampling distr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal and Information Processing over Networks
سال: 2019
ISSN: 2373-776X,2373-7778
DOI: 10.1109/tsipn.2018.2869354